#include "sort.h"
#include "test.h"
#include "Stack.h"

void print(int*a,int n)
{
	int i = 0;
	for (i = 0; i < n; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
}

void test1()
{
	int* a = NULL;
	int b[10] = { 4,1,7,5,9,2,8,3,6,10 };
	//int b[10] = { 4,1,7,4,9,4,8,3,4,10 };
	a = b;
	print(a, 10);
	//InsertSort(a, 10);
	//print(a, 10);
	//BubbleSort(a, 10);
	//print(a, 10);
	//ShellSort(a, 10);
	//print(a, 10);
	//SelectSort(a, 10);
	//print(a, 10);
	//HeapSort(a, 10);
	//print(a, 10);
	//QuickSort(a, 0, 10);
	//print(a, 10);
	//QuickSortNonR(a, 0, 10);
	//print(a, 10);
	//MergeSort(a, 10);
	//print(a, 10);
	//MergeSortNonR(a, 10);
	//print(a, 10);
	CountSort(a, 10);
	print(a, 10);

}

int main()
{
	test1();

	//TestOP();
	return 0;
}


void TestOP()
{
	srand(time(0));
	const int N = 50000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);
	int* a9 = (int*)malloc(sizeof(int) * N);
	int* a10 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
		a8[i] = a1[i];
		a9[i] = a1[i];
		a10[i] = a1[i];
	}
	int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();
	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();
	int begin3 = clock();
	BubbleSort(a3, N);
	int end3 = clock();
	int begin4 = clock();
	SelectSort(a4, N);
	int end4 = clock();
	int begin5 = clock();
	HeapSort(a5, N);
	int end5 = clock();
	int begin6 = clock();
	QuickSort(a6, 0, N);
	int end6 = clock();
	int begin7 = clock();
	QuickSortNonR(a7, 0, N);
	int end7 = clock();
	int begin8 = clock();
	MergeSort(a8, N);
	int end8 = clock();
	int begin9 = clock();
	MergeSortNonR(a9, N);
	int end9 = clock();
	int begin10 = clock();
	CountSort(a10, N);
	int end10 = clock();
	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("BubbleSort:%d\n", end3 - begin3);
	printf("SelectSort:%d\n", end4 - begin4);
	printf("HeapSort:%d\n", end5 - begin5);
	printf("QuickSort:%d\n", end6 - begin6);
	printf("QuickSortNonR:%d\n", end7 - begin7);
	printf("MergeSort:%d\n", end8 - begin8);
	printf("MergeSortNonR:%d\n", end9 - begin9);
	printf("CountSort:%d\n", end10 - begin10);
	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
	free(a8);
	free(a9);
	free(a10);
}